High-Speed Fractal Image Compression Featuring Deep Data Pipelining Strategy
نویسندگان
چکیده
منابع مشابه
High Speed Lossless Image Compression
We introduce a simple approach to lossless image compression, which makes use of SIMD vectorization at every processing step to provide very high speed on modern CPUs. This is achieved by basing the compression on delta coding for prediction and bit packing for the actual compression, allowing a tuneable tradeoff between efficiency and speed, via the block size used for bit packing. The maximum...
متن کاملFractal image compression
The top-selling multimedia encyclopedia Encarta, published by Microsoft Corporation, includes on one CD-ROM seven thousand color photographs which may be viewed interactively on a computer screen. The images are diverse; they are of buildings, musical instruments, people’s faces, baseball bats, ferns, etc. What most users do not know is that all of these photographs are based on fractals and th...
متن کاملFractal Image Compression
Standard graphics systems encode pictures by assigning an address and colour attribute for each point of the object resulting in a long list of addresses and attributes. Fractal geometry enables a newer class of geometrical shapes to be used to encode whole objects, thus image compression is achieved. Compression ratios of 10,000:1 have been claimed by researchers in this field. The fractal equ...
متن کاملFractal Image Compression
The first fully automated fractal image compression algorithm was published by Arnaud Jacquin in 1989. Given an image f , the encoder finds a contractive affine image transformation (fractal transform) T such that the fixed point of T is close to f . The decoding is by iteration of the fractal transform starting from an arbitrary image. Due to the contraction mapping principle, the sequence of ...
متن کاملEvolutionary fractal image compression
This paper introduces evolutionary computing to fractal image compression. In fractal image compression [1] a partitioning of the image into ranges is required. We propose to use evolutionary computing to find good partitionings. Here ranges are connected sets of small square image blocks. Populations consist of Np configurations, each of which is a partitioning with a fractal code. In the evol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2880480